Helly-type Theorems for Hollow Axis-aligned Boxes

نویسنده

  • KONRAD J. SWANEPOEL
چکیده

A hollow axis-aligned box is the boundary of the cartesian product of d compact intervals in Rd. We show that for d ≥ 3, if any 2d of a collection of hollow axis-aligned boxes have non-empty intersection, then the whole collection has non-empty intersection; and if any 5 of a collection of hollow axis-aligned rectangles in R2 have non-empty intersection, then the whole collection has non-empty intersection. The values 2d for d ≥ 3 and 5 for d = 2 are the best possible in general. We also characterize the collections of hollow boxes which would be counterexamples if 2d were lowered to 2d − 1, and 5 to 4, respectively. 1. General notation and definitions We denote the cardinality of a set S by #S. Let Π(S, k) denote the property that any subcollection of S of at most k sets has non-empty intersection (where k is any positive integer), and Π(S) the property that S has non-empty intersection. For any set S ⊆ R, we denote the convex hull, interior and boundary by co S, intS and bd S, respectively. An axis-aligned box in R is the cartesian product of d compact intervals, i.e. a set of the form

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Discrete and Lexicographic Helly Theorems and their Relations to LP-Type Problems

Helly’s theorem says that if every d + 1 elements of a given finite set of convex objects in IR have a common point, then there is a point common to all of the objects in the set. We define three new types of Helly theorems: discrete Helly theorems where the common point should belong to an a-priori given set, lexicographic Helly theorems where the common point should not be lexicographically g...

متن کامل

On the Algorithmic Aspects of Discrete and Lexicographic Helly-Type Theorems and the Discrete LP-Type Model

Helly’s theorem says that, if every d+1 elements of a given finite set of convex objects in Rd have a common point, there is a point common to all of the objects in the set. In discrete Helly theorems the common point should belong to an a priori given set. In lexicographic Helly theorems the common point should not be lexicographically greater than a given point. Using discrete and lexicograph...

متن کامل

Tolerance in Helly-Type Theorems

In this paper we introduce the notion of tolerance in connection with Helly type theorems and prove, using the Erdős-Gallai theorem, that any Helly type theorem can be generalized by relaxing the assumptions and conclusion, allowing a bounded number of exceptional sets or points. In particular, we analyze some of the classical Helly type theorems, such as Caratheodory’s and Tverberg’s theorems,...

متن کامل

Discrete and Lexicographic Helly-Type Theorems

Helly’s theorem says that if every d + 1 elements of a given finite set of convex objects in R have a common point, then there is a point common to all of the objects in the set. We define three new types of Helly theorems: discrete Helly theorems—where the common point should belong to an a-priori given set, lexicographic Helly theorems—where the common point should not be lexicographically gr...

متن کامل

Transversal and Helly-type Theorems in Geometry, Combinatorics and Topology

Helly’s theorem also holds for infinite families of compact convex sets, and has stimulated numerous generalization and variants. Results of the type “if every m members of a family of objects have property P then the entire family has the property P” are called Helly-type theorems. The minimum positive integer m that makes this theorem possible is called the Helly number. Helly-type theorems h...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 1999